Adjacent vertices on the b-matching polyhedron
نویسندگان
چکیده
منابع مشابه
Estimating the number of vertices of a polyhedron
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P . The estimates are based on applying tree estimation methods to the reverse search technique. The time to generate an unbiased estimate is essentially bounded by the time taken to solve a linear program on P with the simplex method. Computational experience is reported. The met...
متن کاملGenerating all vertices of a polyhedron is hard 1 , 2
We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in both the directed and undirected cases. More precisely, given a family of (directed) negative cycles, it is an NP-complete problem to decide whether this family can be extended or there are no other negative (directed) cycles in the graph, implying that (directed) negative cycles cannot be generate...
متن کاملOn Graphs with Adjacent Vertices of Large Degree
Let g(n, m) denote the class of simple graphs on n vertices and m edges and let C E 9( a, m). For suitably restricted values of m, C will necessarily contain certain prescribed subgraphs such as cycles of given lengths and complete graphs . For example> if m > 7nZ then G contains cycles of all lengths up to Li(n+ 3) J . Recently we have established a number of results concerning the existence o...
متن کاملAdjacent Vertices Fault-tolerance Fanability of Hypercube
In this paper, we introduce the concepts of fault tolerant fanability. We show that the ndimensional hypercube Qn are f-adjacent and l edges fault tolerant (n− f − l)-fanable for n ≥ 3, f + l ≤ n− 2 and l ≥ 1.
متن کاملThe Price of Matching Selfish Vertices
We analyze the setting of minimum-cost perfect matchings with selfish vertices through the price of anarchy (PoA) and price of stability (PoS) lens. The underlying solution concept used for this analysis is the Gale-Shapley stable matching notion, where the preferences are determined so that each player (vertex) wishes to minimize the cost of her own matching edge.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1981
ISSN: 0012-365X
DOI: 10.1016/0012-365x(81)90256-9